Transformation-Enabled Precondition Inference

نویسندگان

چکیده

Precondition inference is a non-trivial problem with important applications in program analysis and verification. We present novel iterative method for automatically deriving preconditions the safety unsafety of programs. Each iteration maintains over-approximations set safe unsafe initial states; which are used to partition program's states into those known be safe, unknown. then construct revised programs unknown iterate procedure until approximations disjoint or some termination criteria met. An experimental evaluation on software verification benchmarks shows that it can infer precise (sometimes optimal) not possible using previous methods.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Counterexample-Guided Precondition Inference

The precondition for an assertion within a procedure is useful for understanding, verifying and debugging programs. As the procedure might be used in multiple calling-contexts within the program, the precondition should be sufficiently precise to enable re-use. We present an extension of counterexample-guided abstraction refinement (CEGAR) for automated precondition inference. Starting with an ...

متن کامل

Precondition Inference for Peephole Optimizations in LLVM

Peephole optimizations are a common source of compiler bugs. Compiler developers typically transform an incorrect peephole optimization into a valid one by strengthening the precondition. This process is challenging and tedious. This paper proposes ALIVE-INFER, a data-driven approach that infers preconditions for peephole optimizations expressed in Alive. ALIVE-INFER generates positive and nega...

متن کامل

Metamaterial-Enabled Transformation Optics

Metamaterial-Enabled Transformation Optics by Nathan Landy Department of Department of Electrical and Computer Engineering Duke University

متن کامل

Comparing Weakest Precondition and Weakest Liberal Precondition

In this article we investigate the relationships between the classical notions of weakest precondition and weakest liberal precondition, and provide several results, namely that in general, weakest liberal precondition is neither stronger nor weaker than weakest precondition, however, given a deterministic and terminating sequential while program and a postcondition, they are equivalent. Hence,...

متن کامل

Towards Testing Model Transformation Chains Using Precondition Construction in Algebraic Graph Transformation

Complex model-based tools such as code generators are typically designed as chains of model transformations taking as input a model of a software application and transforming it through several intermediate steps and representations. The complexity of intermediate models is such that testing is more conveniently done on the integrated chain, with test models expressed in the input language. To ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theory and Practice of Logic Programming

سال: 2021

ISSN: ['1471-0684', '1475-3081']

DOI: https://doi.org/10.1017/s1471068421000272